Counterfactual thinking, or simulating alternative versions of occurred events, is a common psychological strategy people use to process events in their lives. However, CFT is also a core com...

We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting.

Both the Beth definability theorem and Craig's lemma (interpolation theorem from now on) deal with the issue of the entanglement of one language L1 with another language L2, that is to say, information transfer—or the lack of such transfer—between the two languages. The notion of splitting we study below looks into this issue. We briefly relate our own results in this area as well as the results of other researchers like Kourousias and Makinson, and Peppas, Chopra and Foo.Section 3 does (...) contain one apparently new theorem. (shrink)

In Language and Equilibrium, Prashant Parikh offers a new account of meaning for natural language. He argues that equilibrium, or balance among multiple interacting forces, is a key attribute of language and meaning and shows how to derive the meaning of an utterance from first principles by modeling it as a system of interdependent games.His account results in a novel view of semantics and pragmatics and describes how both may be integrated with syntax. It considers many aspects of meaning--including (...) literal meaning and implicature--and advances a detailed theory of definite descriptions as an application of the framework.Language and Equilibrium is intended for a wide readership in the cognitive sciences, including philosophers, linguists, and artificial intelligence researchers as well as neuroscientists, psychologists, and economists interested in language and communication. (shrink)

Aversive autobiographical memories sometimes prompt maladaptive emotional responses and contribute to affective dysfunction in anxiety and depression. One way to regulate the impact of such memories is to create a downward counterfactual thought–a mental simulation of how the event could have been worse–to put what occurred in a more positive light. Despite its intuitive appeal, counterfactual thinking has not been systematically studied for its regulatory efficacy. In the current study, we compared the regulatory impact of downward counterfactual thinking, temporal distancing, (...) and memory rehearsal in 54 adult participants representing a spectrum of trait anxiety. Participants recalled regretful experiences and rated them on valence, arousal, regret, and episodic detail. Two to six days later, they created a downward counterfactual of the remembered event, thought of how they might feel about it 10 years from now, or simply rehearsed it. A day later, participants re-rated the phenomenological characteristics of the events. Across all participants, downward counterfactual thinking, temporal distancing, and memory rehearsal were equally effective at reducing negative affect associated with a memory. However, in individuals with higher trait anxiety, downward counterfactual thinking was more effective than rehearsal for reducing regret, and it was as effective as distancing in reducing arousal. We discuss these results in light of the functional theory of counterfactual thinking and suggest that they motivate further investigation into downward counterfactual thinking as a means to intentionally regulate emotional memories in affective disorders. (shrink)

Communication and content presents a comprehensive and foundational account of meaning based on new versions of situation theory and game theory. The literal and implied meanings of an utterance are derived from first principles assuming little more than the partial rationality of interacting agents. New analyses of a number of diverse phenomena – a wide notion of ambiguity and content encompassing phonetics, syntax, semantics, pragmatics, and beyond, vagueness, convention and conventional meaning, indeterminacy, universality, the role of truth in communication, semantic (...) change, translation, Frege’s puzzle of informative identities – are developed. Communication, speaker meaning, and reference are defined. Frege’s context and compositional principles are generalized and reconciled in a fixed-point principle, and a detailed critique of Grice, several aspects of Lewis, and some aspects of the Romantic conception of meaning are offered. Connections with other branches of linguistics, especially psycholinguistics, sociolinguistics, historical linguistics, and natural language processing, are explored. -/- The book will be of interest to scholars in philosophy, linguistics, artificial intelligence, and cognitive science. It should also interest readers in related fields like literary and cultural theory and the social sciences. (shrink)

We introduce a generalization of Independence Friendly logic in which Eloise is restricted to a finite amount of information about Abelard’s moves. This logic is shown to be equivalent to a sublogic of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to logic.

We propose a model for belief which is free of presuppositions. Current models for belief suffer from two difficulties. One is the well known problem of logical omniscience which tends to follow from most models. But a more important one is the fact that most models do not even attempt to answer the question what it means for someone to believe something, and just what it is that is believed. We provide a flexible model which allows us to give meaning (...) to beliefs in general contexts, including the context of animal belief , and of human belief which is expressed in language. (shrink)

Each of us has a story which we can think of as a set of beliefs, hopefully consistent. We make our decisions in view of our beliefs which may be probabilistic, in the general case, but simple yes or no as in this paper. Our beliefs are our envelope just as the shell of a tortoise is its envelope. Decision theory—or single agent game theory tells us when to make the best choice in a game of us against nature. But (...) nature has no desire to further or frustrate our efforts. Nature is mysterious but not malign. Things change when there are other agents involved. Then the best thing for us to do will depend on what they do. And they will think the same. And we predict their actions in terms of what we think their beliefs are. But how do we coordinate with others whose beliefs are different? This paper addresses the issue of working together despite different beliefs. (shrink)

Attempts to give a Logic or Semantics for vague predicates and to defuse the Sorites paradoxes have been largely a failure. We point out yet another problem with these predicates which has not been remarked on before,namely that different people do and must use these predicates in individually different ways. Thus even if there were a semantics for vague predicates, people would not be able to share it. To explain the occurrence nonetheless of these troublesome predicates in language, we propose (...) a different approach based on asking the question, “How do these vague predicates help people to communicate with each other?” We show that in general, even though different people assign different extensions to vague predicates, they usually benefit from receiving information framed in terms of them. (shrink)

We investigate the semantics of messages, and argue that the meaning ofa message is naturally and usefully given in terms of how it affects theknowledge of the agents involved in the communication. We note thatthis semantics depends on the protocol used by the agents, and thus not only the message itself, but also the protocol appears as a parameter in the meaning. Understanding this dependence allows us to give formal explanations of a wide variety of notions including language dependence, implicature, (...) and the amount of information in a message. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

We propose a new relevance sensitive model for representing and revising belief structures, which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically plausible, computationally tractable procedures for query answering and belief..

This paper extends Parikh's earlier work in semantics with games of partial information and attempts to derive and represent the full content of an utterance from first principles. It also discusses various ways in which this content may be indeterminate.

We suggest that the issue of constructing andverifying social procedures, which we suggestively call socialsoftware, be pursued as systematically as computer software is pursued by computer scientists. Certain complications do arise withsocial software which do not arise with computer software, but thesimilarities are nonetheless strong, and tools already exist which wouldenable us to start work on this important project. We give a variety ofsuggestive examples and indicate some theoretical work which alreadyexists.

Journal of Philosophical Logic 34, 97-119, 2005.

Subset Spaces were introduced by L. Moss and R. Parikh in [8]. These spaces model the reasoning about knowledge of changing states.In [2] a kind of subset space called intersection space was considered and the question about the existence of a set of axioms that is complete for the logic of intersection spaces was addressed. In [9] the first author introduced the class of directed spaces and proved that any set of axioms for directed frames also characterizes intersection spaces.We (...) give here a complete axiomatization for directed spaces. We also show that it is not possible to reduce this set of axioms to a finite set. (shrink)

In his deeply personal yet academically rigorous book, The Ethics of Oneness: Emerson, Whitman, and the Bhagavad Gita, Jeremy Engels takes up the task of describing and critiquing the quintessential U.S. American philosophies of Ralph Waldo Emerson and Walt Whitman. Though much ink has been spilled over these two philosophers, there are two features of Engels approach to their description and critique that make it unique when compared with other books that delve into the history of Indian philosophy’s influence on (...) these American philosophers. Engels’ purpose is not simply to recount the history, but rather to explicate Emerson and Whitman’s philosophies in light of that history in a way that makes them relevant to... (shrink)

We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations are ternary (...) (using context as a parameter) as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely presented formalism and a plausible model of reasoning for automated agents. (shrink)

In strategic situations, agents base actions on knowledge and beliefs. This includes knowledge about others’ strategies and preferences over strategy profiles, but also about other external factors. Bernheim and Pearce in 1984 independently defined the game theoretic solution concept of rationalizability, which is built on the premise that rational agents will only take actions that are the best response to some situation that they consider possible. This accounts for other agents’ rationality as well, limiting the strategies to which a particular (...) agent must respond, enabling further elimination until the strategies stabilize. We seek to generalize rationalizability to account not only for actions, but knowledge of the world as well. This will enable us to examine the interplay between action based and knowledge based rationality. We give an account of what it means for an action to be rational relative to a particular state of affairs, and in turn relative to a state of knowledge. We present a class of games, Epistemic Messaging Games, with a communication stage that clarifies the epistemic state among the players prior to the players’ actions. We use a history based model, which frames individual knowledge in terms of local projections of a global history. With this framework, we give an account of rationalizability for subclasses of EMG. (shrink)

The primary function of language is communication. We use the tools of situation theory and game theory to develop a definition and model of communication between rational agents using a shared situated language. ;A central thesis of this dissertation is that the key feature of situated communication that enables agents to derive content from meaning is a special type of logical inference called a strategic inference. ;The model we develop, called the Strategic Discourse Model, looks at a single strategic inference. (...) An essential element of a strategic inference is that the content depends on the sentence uttered and on the embedding circumstances. This includes the private and public information and beliefs of the agents, their goals and intentions, and crucially, the other sentences the speaker might have uttered but chose not to. A complete model of communication involves a system of simultaneous strategic inferences. ;When the strategic interaction between two agents is common knowledge between them, that is, when it is a game, the information transfer is a communication. The content communicated is given by the solution to the game. This analysis formalizes Grice's ideas on nonnatural meaning within a situation-theoretic framework. A consequence of our situated analysis is that agents do not need to have the complex and infinite set of nested intentions postulated by the Gricean approach. A simple intention to communicate is all that is required, the ambient game doing the rest of the work. ;This model has many applications. Problems like resolving ambiguity, determining reference, inferring implicatures and indirect speech acts fall within its scope. As one application, we outline a new theory of names and definite descriptions. This account builds upon Russell and Strawson, and Barwise and Perry. The basic idea is that names and descriptions can both be used in various ways circumscribed by an ontological and a communicative constraint. This offers a new solution to the puzzle of informative identity statements and clarifies the referential-attributive distinction. It suggests an approach to the concept of representation. ;An underlying theme is to synthesize situation theory and game theory. (shrink)

We develop an analysis of discourse anaphora—the relationship between a pronoun and an antecedent earlier in the discourse —using games of partial information. The analysis is extended to include information from a variety of different sources, including lexical semantics, contrastive stress, grammatical relations, and decision theoretic aspects of the context.

One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact (...) that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic. (shrink)

Editorial Rohit Parikh, Jeffrey Helzner, Episteme, FirstView Article.

The standard theory for belief revision provides an elegant and powerful framework for reasoning about how a rational agent should change its beliefs when confronted with new information. However, the agents considered are extremely idealized. Some recent models attempt to tackle the problem of plausible belief revision by adding structure to the belief bases and using nonstandard inference operations. One of the key ideas is that not all of an agent's beliefs are relevant for an operation of belief change.In this (...) paper we incorporate the insights pertaining to local change and relevance sensitivity with the use of approximate inference relations. These approximate inference relations offer us partial solutions at any stage of the revision process. The quality of the approximations improves as we allow for more and more resources to be used. We are provided with upper and lower bounds to what would be obtained with the use of classical inference. (shrink)

Game Logic is a modal logic which extends Propositional Dynamic Logic by generalising its semantics and adding a new operator to the language. The logic can be used to reason about determined 2-player games. We present an overview of meta-theoretic results regarding this logic, also covering the algebraic version of the logic known as Game Algebra.